A New Mechanism for Maintaining Diversity of Pareto Archive in Multiobjective Optimization
نویسندگان
چکیده
The article introduces a new mechanism for selecting individuals to a Pareto archive. It was combined with a micro-genetic algorithm and tested on several problems. The ability of this approach to produce individuals uniformly distributed along the Pareto set without negative impact on convergence is demonstrated on presented results. The new concept was confronted with NSGA-II, SPEA2, and IBEA algorithms from the PISA package. Another studied effect is the size of population versus number of generations for small populations.
منابع مشابه
Multiobjective Differential Evolution with External Archive and Harmonic Distance-Based Diversity Measure
This paper presents an approach to incorporate Pareto dominance into the differential evolution (DE) algorithm in order to solve optimization problems with more than one objective by using the DE algorithm. Unlike the existing proposals to extend the DE to solve multiobjective optimization problems, our algorithm uses an external archive to store nondominated solutions. In order to generate tri...
متن کاملMOCell: A cellular genetic algorithm for multiobjective optimization
This paper introduces a new cellular genetic algorithm for solving multiobjective continuous optimization problems. Our approach is characterized by using an external archive to store nondominated solutions and a feedback mechanism in which solutions from this archive randomly replace existing individuals in the population after each iteration. The result is a simple and elitist algorithm calle...
متن کاملDynamic Archive Evolution Strategy for Multiobjective Optimization
This paper proposes a new multiobjective evolutionary approach the dynamic archive evolution strategy (DAES) to investigate the adaptive balance between proximity and diversity. In DAES, a novel dynamic external archive is proposed to store elitist individuals as well as relatively better individuals through archive increase scheme and archive decrease scheme. Additionally, a combinatorial ope...
متن کاملAbYSS: Adapting Scatter Search for Multiobjective Optimization
In this paper we propose a new algorithm for solving multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to the multiobjective domain. The result is a hybrid metaheuristic algorithm called AbYSS, which follows the scatter search structure but using mutation and crossover operators coming from the field of evolutionar...
متن کاملStochastic Fractal Based Multiobjective Fruit Fly Optimization
The fruit fly optimization algorithm (FOA) is a global optimization algorithm inspired by the foraging behavior of a fruit fly swarm. In this study, a novel stochastic fractal model based fruit fly optimization algorithm is proposed for multiobjective optimization. A food source generating method based on a stochastic fractal with an adaptive parameter updating strategy is introduced to improve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Advances in Engineering Software
دوره 41 شماره
صفحات -
تاریخ انتشار 2010